Three Problems for the Clairvoyant Demon
نویسنده
چکیده
A number of tricky problems in probability are discussed, having in common one or more infinite sequences of coin tosses, and a representation as a problem in dependent percolation. Three of these problems are of ‘Winkler’ type, that is, they ask about what can be achieved by a clairvoyant demon.
منابع مشابه
1 Three problems for the clairvoyant demon
A number of tricky problems in probability are discussed, having in common one or more infinite sequences of coin tosses, and a representation as a problem in dependent percolation. Three of these problems are of ‘Winkler’ type, that is, they are challenges for a clairvoyant demon.
متن کاملCollisions Among Random Walks on a Graph
17 There is one further consideration, which leads perhaps to the most intriguing conjecture of all. Let us put two tokens on a graph and let them take random walks, as before; but now suppose the schedule demon is clairvoyant|that is, he can see where each token will go, innnitely far into the future. The question is, with this advantage, can he now keep the tokens apart forever ? Of course we...
متن کاملNon-Clairvoyant Online Scheduling to Minimize Energy
Scheduling multiple jobs released over time on a single machine with adjustable speed is a fundamental and well-studied problem with varied applications both in classical domains such as scheduling jobs in operating systems and in emerging disciplines such as data center management, green computing, etc. The typical objective in such scheduling problems is two-fold: to minimize the flow-time of...
متن کاملA Brief Overview of the Clairvoyant Demon
Let G be a connected graph, and X and Y be two tokens placed on G. We move both X and Y with simple random walks on G. Each turn one of the tokens will be moved along its walk, however we may choose which token to advance each turn. Furthermore we will assume that the entire random walk that both X and Y will take are known. The question we explore is: given the knowledge of the entire walk in ...
متن کاملSemi-clairvoyant Scheduling
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2] it was left as an open question whether it was possible for a semiclairvoyant algorithm to be O(1)-competitive with respect to average flow time on a single machine. Here we settle this open question by giving a semi...
متن کامل